Time-constrained project scheduling with adjacent resources
نویسندگان
چکیده
منابع مشابه
Time-constrained project scheduling with adjacent resources
We develop a decomposition method for project scheduling problems with adjacent resources. Adjacent resources are resources for which the units assigned to a job are required to be in some sense adjacent. Possible examples of adjacent resources are dry docks, shop floor spaces, and assembly areas. We focus on the Time-Constrained Project Scheduling Problem (TCPSP), [4], with one 1-dimensional a...
متن کاملProject Scheduling with Simultaneous Optimization, Time, Net Present Value, and Project Flexibility for Multimode Activities with Constrained Renewable Resources
Project success is assessed based on various criteria, every one of which enjoys a different level of importance for the beneficiaries and decision makers. Time and cost are the most important objectives and criteria for the project success. On the other hand, reducing the risk of finishing activities until the predetermined deadlines should be taken into account. Having formulated the problem ...
متن کاملRobust project scheduling with two constrained resources
Distinct from ordinary project scheduling to minimize project completion time, this study conducts robust project scheduling with two resources constraints. In this study, actual start time of each operation is dynamic. The latest finish time minus actual finish time is the slack time available to each operation. The objective of this study is to determine all project operation times and slack ...
متن کاملTime-constrained project scheduling
We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines, it is possible to work in overtime or hire additional capacity in regular time or overtime. For this problem, we develop a two stage heuristic. The key of the approach lies in the first stage in which we construct p...
متن کاملTime-constrained loop scheduling with minimal resources
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a new technique, extended retiming, which can be combined with minimal unfolding to transform a DFG into one which is rate-optimal. The result, however, is a DFG with split nodes, a concise representation for pipelined s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2011
ISSN: 0305-0548
DOI: 10.1016/j.cor.2010.05.006